09. Greatest common divisor

gcd.default

gcd.numeric

gcd.vli

object of class vli or 32 bits integer

<code>gcd</code> computes and returns the greatest common divisor of two vli (Very Large Integers) objects.

Multi-precision library that allows to store and operate with arbitrarily big integers without
loss of precision. It includes a large list of tools to work with them, like:
- Arithmetic and logic operators
- Modular-arithmetic operators
- Computer Number Theory utilities
- Probabilistic primality tests
- Factorization algorithms
- Random generators of diferent types of integers.

Javier Cuadrado

VeryLargeIntegers

Store and Operate with Arbitrarily Large Integers

09. Greatest common divisor function

<dl><dt>x</dt>
<dd>object of class vli or 32 bits integer</dd>
<dt>y</dt>
<dd>object of class vli or 32 bits integer</dd></dl>

Arguments

Author

Greatest Common Divisor for vli Objects — 09. Greatest common divisor

<dl>

<dt>x</dt>
<dd>object of class vli or 32 bits integer</dd>


<dt>y</dt>
<dd>object of class vli or 32 bits integer</dd>

</dl>

09. Greatest common divisor: Greatest Common Divisor for vli Objects

Description

Usage

Value

Arguments

Author

Examples